Overall Objectives
Research Program
New Software and Platforms
New Results
- Dataflow-explicit futures
- Distributed futures
- Locally abstract globally concrete semantics
- Memory consistency for heterogeneous systems
- PNets: Parametrized networks of automata
- Decidability results on the verification of phaser programs
- A Survey on Verified Reconfiguration
- A Survey on Parallelism and Determinacy
- Pipeline-aware Scheduling of Polyhedral Process Networks
- A Compiler Algorithm to Guide Runtime Scheduling
- fkcc: the Farkas Calculator
- Standard-compliant Parallel SystemC simulation of Loosely-Timed Transaction Level Models
- Response time analysis of dataflow applications on a many-core processor with shared-memory and network-on-chip
- Smart placement of dynamically allocated objects for heterogeneous memory
- Static Analysis Of Binary Code With Memory Indirections Using Polyhedra
- Polyhedral Value Analysis as Fast Abstract Interpretation
- Decision results for solving Horn Clauses with arrays
- Scheduling Trees
- Formalisation of the Polyhedral Model
- Semantics diffs in LLVM
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
New Software and Platforms
New Results
- Dataflow-explicit futures
- Distributed futures
- Locally abstract globally concrete semantics
- Memory consistency for heterogeneous systems
- PNets: Parametrized networks of automata
- Decidability results on the verification of phaser programs
- A Survey on Verified Reconfiguration
- A Survey on Parallelism and Determinacy
- Pipeline-aware Scheduling of Polyhedral Process Networks
- A Compiler Algorithm to Guide Runtime Scheduling
- fkcc: the Farkas Calculator
- Standard-compliant Parallel SystemC simulation of Loosely-Timed Transaction Level Models
- Response time analysis of dataflow applications on a many-core processor with shared-memory and network-on-chip
- Smart placement of dynamically allocated objects for heterogeneous memory
- Static Analysis Of Binary Code With Memory Indirections Using Polyhedra
- Polyhedral Value Analysis as Fast Abstract Interpretation
- Decision results for solving Horn Clauses with arrays
- Scheduling Trees
- Formalisation of the Polyhedral Model
- Semantics diffs in LLVM
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Previous | 
Home